Termination w.r.t. Q proof of TRS/SK902.41.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

norm(nil) → 0
norm(g(x, y)) → s(norm(x))
f(x, nil) → g(nil, x)
f(x, g(y, z)) → g(f(x, y), z)
rem(nil, y) → nil
rem(g(x, y), 0) → g(x, y)
rem(g(x, y), s(z)) → rem(x, z)

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

norm(nil) → 0
norm(g(x, y)) → s(norm(x))
f(x, nil) → g(nil, x)
f(x, g(y, z)) → g(f(x, y), z)
rem(nil, y) → nil
rem(g(x, y), 0) → g(x, y)
rem(g(x, y), s(z)) → rem(x, z)

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Precedence:

f₂ > nil > rem₂
f₂ > g₂ > norm₁ > 0 > rem₂
f₂ > g₂ > s₁ > rem₂

Status:

norm₁: multiset
rem₂: multiset
g₂: [1,2]
f₂: multiset
s₁: multiset
0: multiset
nil: multiset